Large Deviation Principle for the Greedy Exploration Algorithm over Erdös-Rényi Graphs
نویسندگان
چکیده
We prove a large deviation principle (LDP) for greedy exploration process on an Erdos-Renyi (ER) graph when the number of nodes goes to this http URL our main result we use general strategy study deviations processes proposed by Feng and Kurtz (2006), which is based convergence non-linear semigroups. The rate function can be expressed in closed form formula associated optimization problems solved explicitly providing trajectory deviation. In addition derive LDP size maximum independent set discovered such algorithm analyze probability that it exceeds known bounds maximal set. also link between these results landscape complexity dynamic.
منابع مشابه
Spectral clustering for multiclass Erdös-Rényi graphs
In this article, we study the properties of the spectral analysis of multiclass Erdös-Rényi graphs. With a view towards using the embedding afforded by the decomposition of the graph Laplacian for subsequent processing, we analyze two basic geometric properties, namely interclass intersection and interclass distance. We will first study the dyadic two-class case in details and observe the exist...
متن کاملAre Erdös- Rényi Random Graphs Topologically Random?
The random graph is a widely applicable construct of study and analysis. Paul Erdös and Alfréd Rényi first proposed a random graph in the late 1950’s [1], as a graph where all edges are chosen based on a uniform probability of appearing in the graph. Since then, the topic of graphs and uses of random graphs has exploded [2]. It was later suggested that these random graphs are the “average” form...
متن کاملSeeded graph matching for correlated Erdös-Rényi graphs
Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical results on the consistency of graph matching for estimating a latent alignment function between the vertex sets of two graphs, as well as subsequent algorithmic implications when the latent alignment is partially observed. In the correlated Erdős-Rényi graph setting, ...
متن کاملConsensus of Interacting Particle Systems on Erdös-Rényi Graphs
Interacting Particle Systems—exemplified by the voter model, iterative majority, and iterative k−majority processes—have found use in many disciplines including distributed systems, statistical physics, social networks, and Markov chain theory. In these processes, nodes update their “opinion” according to the frequency of opinions amongst their neighbors. We propose a family of models parameter...
متن کاملA Large Deviation Principle for Martingales over Brownian Filtration
In this article we establish a large deviation principle for the family {ν ε : ε ∈ (0, 1)} of distributions of the scaled stochastic processes {P − log √ ε Z t } t≤1 , where (Z t) t∈[0,1] is a square-integrable martingale over Brownian filtration and (P t) t≥0 is the Ornstein-Uhlenbeck semigroup. The rate function is identified as well in terms of the Wiener-Itô chaos decomposition of the termi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ALEA-Latin American Journal of Probability and Mathematical Statistics
سال: 2022
ISSN: ['1980-0436']
DOI: https://doi.org/10.30757/alea.v19-16